Qué (quién) es Dynamic Execution - definición
CPU PARADIGM IN WHICH A PROCESSOR EXECUTES INSTRUCTIONS IN AN ORDER BASED ON AVAILABILITY OF INPUT DATA/EXECUTION UNITS RATHER THAN ORIGINAL ORDER IN A PROGRAM, THUS AVOIDING IDLENESS WHILE WAITING FOR THE PRECEDING INSTRUCTION TO COMPLETE
Decoupled architecture; Out of Order execution; Out of order execution; Decoupled Architecture; OOOE; Oooe; OoOE; Out-of-order code execution; OOE; Dynamic execution; In-order processor; Out-of-order microprocessor; Out-of-order processor; Out-of-order CPU; Instruction dispatch
Dynamic Execution
<processor> A combination of techniques - {multiple branch
prediction}, data flow analysis and speculative execution.
Intel implemented Dynamic Execution in the P6 after
analysing the execution of billions of lines of code.
(1995-05-05)
Out-of-order execution
In computer engineering, out-of-order execution (or more formally dynamic execution) is a paradigm used in most high-performance central processing units to make use of instruction cycles that would otherwise be wasted. In this paradigm, a processor executes instructions in an order governed by the availability of input data and execution units, rather than by their original order in a program.
Execution (computing)
PROCESS BY WHICH A COMPUTER OR A VIRTUAL MACHINE PERFORMS THE INSTRUCTIONS OF A COMPUTER PROGRAM
Execution (program); Execution (computers); Execution context; Execution (software); Software execution; Invoke operator (computer programming)
Execution in computer and software engineering is the process by which a computer or virtual machine reads and acts on the instructions of a computer program. Each instruction of a program is a description of a particular action which must be carried out, in order for a specific problem to be solved.
Wikipedia
Out-of-order execution
In computer engineering, out-of-order execution (or more formally dynamic execution) is a paradigm used in most high-performance central processing units to make use of instruction cycles that would otherwise be wasted. In this paradigm, a processor executes instructions in an order governed by the availability of input data and execution units, rather than by their original order in a program. In doing so, the processor can avoid being idle while waiting for the preceding instruction to complete and can, in the meantime, process the next instructions that are able to run immediately and independently.
